Compression block input/output reduction

ABSTRACT

Exemplary method, system, and computer program product embodiments compression blocks input/output (I/O) reduction are provided. In one embodiment, by way of example only, data blocks are arranged into groups to provide a single I/O. Lists indicating the available block space for the data blocks are organized in advance according to space size. The data blocks required for a single command are allocated as the single I/O. The data blocks are sequentially ordered. Additional system and computer program product embodiments are disclosed and provide related advantages.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of U.S. patent application Ser. No.13/345,301, filed on Jan. 6, 2012.

FIELD OF THE INVENTION

The present invention relates generally to computers, and moreparticularly, to compression blocks input/output (I/O) reduction in acomputing environment.

DESCRIPTION OF THE RELATED ART

In today's society, computer systems are commonplace. Computer systemsmay be found in the workplace, at home, or at school. Computer systemsmay include data storage systems, or disk storage systems, to processand store data. In recent years, both software and hardware technologieshave experienced amazing advancement. With the new technology, more andmore functions are added and greater convenience is provided for usewith these electronic appliances. One of the most noticeable changesintroduced by recent computer technology is the inclusion of images,video, and audio to enhance the capabilities of computers and electronicappliances. Iii the age of multimedia., the amount of information to beprocessed increases greatly. One popular method of handling large datafiles is to compress the data for storage or transmission. Datacompression is widely used to reduce the amount of data required toprocess, transmit, or store a given quantity of information. Compressioncan be used, for example, to reduce the storage requirements for files,to increase the communication rate over a channel, or to reduceredundancy prior to encryption for greater security.

SUMMARY OF THE DESCRIBED EMBODIMENTS

With increasing demand for faster, more powerful and more efficient waysto store and retrieve information, optimization of storage technologiesis becoming a key challenge. Logical data objects (data files, imagefiles, data blocks, etc.) may be compressed for transmission and/orstorage. Disk compression provides for the compression of individualfiles or directories to be stored on a hard disk. Disk compressionenables data to be accessed randomly by dividing logical unit into smallblocks. Each block starts with new dictionary to enable decompressing ofthe data block independently and random access to the data.

However, when the data size of a write command is larger than the sizeof the compressed block, the write command will cause a write operationon multiple blocks. The multiple blocks may generate much moreInput/Output (I/O) on the disk than requested by the user. It ispossible to increase the size of the compressed block to a maximum sizeof the write operation. However, this solution will cause largecompression blocks, which have a negative effect on random access,memory and performance. Thus, a need exists to combine multiplecompressed blocks and allocate continuous blocks required for a singlecommand and write them as one I/O.

Accordingly, and in view of the foregoing, various exemplary method,system, and computer program product embodiments for compression blocksinput/output (I/O) reduction operations are provided. In one embodiment,by way of example only, data blocks are arranged into groups to providea single I/O. Lists indicating the available block space for the datablocks are organized in advance according to space size. The data blocksrequired for a single command are allocated as the single I/O. The datablocks are sequentially ordered. Additional system and computer programproduct embodiments are disclosed and provide related advantages.

The foregoing summary has been provided to introduce a selection ofconcepts in a simplified form that are further described below in theDetailed Description. This Summary is not intended to identify keyfeatures or essential features of the claimed subject matter, nor is itintended to be used as an aid in determining the scope of the claimedsubject matter. The claimed subject matter is not limited toimplementations that solve any or all disadvantages noted in thebackground.

BRIEF DESCRIPTION OF THE DRAWINGS

In order that the advantages of the invention will be readilyunderstood, a more particular description of the invention brieflydescribed above will be rendered by reference to specific embodimentsthat are illustrated in the appended drawings. Understanding that thesedrawings depict embodiments of the invention and are not therefore to beconsidered to be limiting of its scope, the invention will be describedand explained with additional specificity and detail through the use ofthe accompanying drawings, in which:

FIG. 1 illustrates a computer storage environment having an examplestorage device in which aspects of the present invention may berealized;

FIG. 2 illustrates an exemplary block diagram showing a hardwarestructure of a data storage system in a computer system in which aspectsof the present invention may be realized;

FIG. 3 illustrates an exemplary block diagram for data compression bydividing data blocks into logical units;

FIG. 4 is a flowchart illustrating an exemplary method for allocatingdata blocks required for a single command as a single Input/Output(I/O);

FIG. 5 is a flowchart illustrating an exemplary method for allocatingdata blocks required for a single command as a single Input/Output (I/O)for write and read commands; and

FIG. 6 is a flowchart illustrating an exemplary method for organizingand using lists that indicate the available space of data blocks.

DETAILED DESCRIPTION OF CERTAIN EMBODIMENTS

As mentioned previously, with increasing demand for faster, morepowerful and more efficient ways to store information, optimization ofstorage technologies is becoming a key challenge. With increasing demandfor faster, more powerful and more efficient ways to store and retrieveinformation, optimization of storage technologies is becoming a keychallenge. Logical data objects (data files, image files, data blocks,etc.) may be compressed for transmission and/or storage. Diskcompression provides for the compression of individual files ordirectories to be stored on a hard disk. Disk compression enables datato be accessed randomly by dividing logical unit into small blocks. Eachblock starts with a new dictionary to enable decompressing of the datablock independently and random access to the data. The dictionary maycontain various pieces of information to enable decompressing the datablocks independently and for random access to the data.

However, when the data size of a write command is larger than the sizeof the compressed block, the write command will cause a write operationon multiple blocks. The multiple blocks may generate much moreInput/Output (I/O) on the disk than requested by the user. For example,the compressed block size may be 64K (Kilobytes) and the data of thewrite command may be 1 MB (Megabyte). The data will compress 320K andwill require 5 compressed blocks. Each block will be written with aseparate command causing 5 times the amount of the original I/Orequests.

It is possible to increase the size of the compressed block to a maximumsize of the write operation. However, this solution will cause largecompression blocks, which have a negative effect on random access,memory and performance. Thus, a need exists to combine multiplecompressed blocks and allocate continuous blocks required for a singlecommand and write them as one I/O.

In contrast, and to address the inefficiencies previously described, themechanisms of the illustrated embodiments serve to create a solution forwriting multiple compressed blocks required for a single command as onlyone I/O. Previously, it was impossible to write multiple blocks in asingle I/O due to the fact that they were not ordered sequentially. Toaccomplish these objectives, in one embodiment, the mechanisms arrangethe compressed data blocks into groups to provide a single I/O. Listsindicating the available block space for the data blocks are organizedin advance according to space size. The data blocks required for asingle command are allocated as the single I/O. The data blocks aresequentially ordered. Blocks may reside on different location on thelogical unit due to the fact they are reused.

Turning to FIG. 1, an example computer system 10 is depicted in whichaspects of the present invention may be realized. Computer system 10includes central processing unit (CPU) 12, which is connected to massstorage device(s) 14 and memory device 16. Mass storage devices mayinclude hard disk drive (HDD) devices, which may be configured in aredundant array of independent disks (RAID). Memory device 16 mayinclude such memory as electrically erasable programmable read onlymemory (EEPROM) or a host of related devices. Memory device 16 and massstorage device 14 are connected to CPU 12 via a signal-bearing medium.In addition, CPU 12 is connected through communication port 18 to acommunication network 20, having an attached plurality of additionalcomputer systems 22 and 24. The computer system 10 may include one ormore processor devices (e.g., CPU 12) and additional memory devices 16for each individual component of the computer system 10.

FIG. 2 is an exemplary block diagram 200 showing a hardware structure ofa data storage system in a computer system according to the presentinvention. Host computers 210, 220, 225, are shown, each acting as acentral processing unit for performing data processing as part of a datastorage system 200. The hosts (physical or virtual devices), 210, 220,and 225 may be one or more new physical devices or logical devices toaccomplish the purposes of the present invention in the data storagesystem 200. In one embodiment, by way of example only, a data storagesystem 200 may be implemented as IBM® System Storage™ DS8000™. A Networkconnection 260 may be a fibre channel fabric, a fibre channel point topoint link, a fibre channel over ethernet fabric or point to point link,a FICON or ESCON I/O interface, any other I/O interface type, a wirelessnetwork, a wired network, a LAN, a WAN, heterogeneous, homogeneous,public (i.e. the Internet), private, or any combination thereof. Thehosts, 210, 220, and 225 may be local or distributed among one or morelocations and may be equipped with any type of fabric (or fabricchannel) (not shown in FIG. 2) or network adapter 260 to the storagecontroller 240, such as Fibre channel, FICON, ESCON, Ethernet, fiberoptic, wireless, or coaxial adapters. Data storage system 200 isaccordingly equipped with a suitable fabric (not shown in FIG. 2) ornetwork adapter 260 to communicate. Data storage system 200 is depictedin FIG. 2 comprising storage controller 240 and storage 230.

To facilitate a clearer understanding of the methods described herein,storage controller 240 is shown in FIG. 2 as a single processing unit,including a microprocessor 242, system memory 243 and nonvolatilestorage (“NVS”) 216, which will be described in more detail below. It isnoted that in some embodiments, storage controller 240 is comprised ofmultiple processing units, each with their own processor complex andsystem memory, and interconnected by a dedicated network within datastorage system 200. Storage 230 may be comprised of one or more storagedevices, such as storage arrays, which are connected to storagecontroller 240 by a storage network.

In some embodiments, the devices included in storage 230 may beconnected in a loop architecture. Storage controller 240 manages storage230 and facilitates the processing of write and read requests intendedfor storage 230. The system memory 243 of storage controller 240 storesprogram instructions and data, which the processor 242 may access forexecuting functions and method steps of the present invention forexecuting and managing storage 230 as described herein. In oneembodiment, system memory 243 includes, is in association with, or is incommunication with the operation software 250 for performing methods andoperations described herein. As shown in FIG. 2, system memory 243 mayalso include or be in communication with a cache 245 for storage 230,also referred to herein as a “cache memory”, for buffering “write data”and “read data”, which respectively refer to write/read requests andtheir associated data. In one embodiment, cache 245 is allocated in adevice external to system memory 243, yet remains accessible bymicroprocessor 242 and may serve to provide additional security againstdata loss, in addition to carrying out the operations as described inherein.

In some embodiments, cache 245 is implemented with a volatile memory andnon-volatile memory and coupled to microprocessor 242 via a local bus(not shown in FIG. 2) for enhanced performance of data storage system200. The NVS 216 included in data storage controller is accessible bymicroprocessor 242 and serves to provide additional support foroperations and execution of the present invention as described in otherfigures. The NVS 216, may also referred to as a “persistent” cache, or“cache memory” and is implemented with nonvolatile memory that may ormay not utilize external power to retain data stored therein. The NVSmay be stored in and with the cache 245 for any purposes suited toaccomplish the objectives of the present invention. In some embodiments,a backup power source (not shown in FIG. 2), such as a battery, suppliesNVS 216 with sufficient power to retain the data stored therein in caseof power loss to data storage system 200. In certain embodiments, thecapacity of NVS 216 is less than or equal to the total capacity of cache245.

Storage 230 may be physically comprised of one or more storage devices,such as storage arrays. A storage array is a logical grouping ofindividual storage devices, such as a hard disk. In certain embodiments,storage 230 is comprised of a JBOD (Just a Bunch of Disks) array or aRAID (Redundant Array of Independent Disks) array. A collection ofphysical storage arrays may be further combined to form a rank, whichdissociates the physical storage from the logical configuration. Thestorage space in a rank may be allocated into logical volumes, whichdefine the storage location specified in a write/read request.

In one embodiment, by way of example only, the storage system as shownin FIG. 2 may include a logical volume, or simply “volume,” may havedifferent kinds of allocations. Storage 230 a, 230 b and 230 n are shownas ranks in data storage system 200, and are referred to herein as rank230 a, 230 b and 230 n. Ranks may be local to data storage system 200,or may be located at a physically remote location. In other words, alocal storage controller may connect with a remote storage controllerand manage storage at the remote location. Rank 230 a is shownconfigured with two entire volumes, 234 and 236, as well as one partialvolume 232 a. Rank 230 b is shown with another partial volume 232 b.Thus volume 232 is allocated across ranks 230 a and 230 b. Rank 230 n isshown as being fully allocated to volume 238—that is, rank 230 n refersto the entire physical storage for volume 238. From the above examples,it will be appreciated that a rank may be configured to include one ormore partial and/or entire volumes. Volumes and ranks may further bedivided into so-called “tracks,” which represent a fixed block ofstorage. A track is therefore associated with a given volume and may begiven a given rank.

The storage controller 240 may include a compression operation module255 and allocation module 257. The compression operation module 255 andallocation module 257 may work in conjunction with each and everycomponent of the storage controller 240, the hosts 210, 220, 225, andstorage devices 230. Both the compression operation module 255 andallocation module 257 may be structurally one complete module or may beassociated and/or included with other individual modules. Thecompression operation module 255 and allocation module 257 may also belocated in the cache 245 or other components.

The storage controller 240 includes a control switch 241 for controllingthe fiber channel protocol to the host computers 210, 220, 225, amicroprocessor 242 for controlling all the storage controller 240, anonvolatile control memory 243 for storing a microprogram (operationsoftware) 250 for controlling the operation of storage controller 240,data for control and each table described later, cache 245 fortemporarily storing (buffering) data, and buffers 244 for assisting thecache 245 to read and write data, a control switch 241 for controlling aprotocol to control data transfer to or from the storage devices 230,and compression operation module 255 and allocation module 257 in whichinformation may be set. Multiple buffers 244 may be implemented with thepresent invention to assist with the operations as described herein.

In one embodiment, the host computers or one or more physical or virtualdevices, 210, 220, 225 and the storage controller 240 are connectedthrough a network adaptor (this could be a fibre channel) 260 as aninterface i.e., via a switch called “fabric.” In one embodiment, theoperation of the system shown in FIG. 2 will be described. Themicroprocessor 242 may control the memory 243 to store commandinformation from the host device (physical or virtual) 210 andinformation for identifying the host device (physical or virtual) 210.The control switch 241, the buffers 244, the cache 245, the operatingsoftware 250, the microprocessor 242, memory 243, NVS 216, compressionoperation module 255 and allocation module 257 are in communication witheach other and may be separate or one individual component(s). Also,several, if not all of the components, such as the operation software250 may be included with the memory 243. Each of the components withinthe devices shown may be linked together and may be in communicationwith each other for purposes suited to the present invention.

FIG. 3 illustrates an exemplary block diagram for data compression bydividing data blocks into logical units. A write command 302 (e.g., adata write command) is issued. The data is compressed. However, thecompressed data 302 is individually compressed to multiple data blocks306 (illustrated as 306A-C). Each one of the multiple blocks 306 (e.g.,306C) may be associated with logical units, with the logical unitsdivided into small blocks 308 (illustrated as 308A-F).

Turning to FIG. 4, a flowchart illustrating an exemplary method 400 forallocating data blocks required for a single command as a singleInput/Output (I/O) is depicted. The method 400 begins (step 402). Themethod 400 may organize lists that indicate available space for datablocks in advance according to space size (step 404). Data blocks arearranged into groups to provide a singe Input/Output (I/O) (step 406).The data blocks are sequentially ordered (step 408). The data blocksrequired for a single command are allocated as a single I/O (step 410).The method 400 ends (step 412).

In an alternative embodiment, data blocks relating to a write commandmay be sequentially allocated. The blocks are then compressedindependently. A single write I0 may be issued to storage containing thecontents of each of the data blocks. Despite the relatively small sizeof the data blocks, the data blocks may be randomly accessed due to thatfact each data block has a new compression dictionary. Alternatively, ifa read operation is executed, the mechanisms may use large read commandsand may fetch all of the corresponding compressed blocks as one readrequest.

In one embodiment, a new block allocation operation (e.g., algorithm)uses multiple lists for each group of free block numbers. For example, agroup of 4 sequential free blocks will be kept in a list for “4sequential blocks”. When a block is freed, the lists are correspondinglyupdated by examining the new status of the free blocks around thatblock. When a group of block allocation is requested, the algorithmtries to allocate the required number of sequential blocks from thecorresponding list. If a group cannot be found in that list, largergroup will be allocated from the next list. These lists may besequentially arranged and ordered as needed.

FIG. 5 is a flowchart illustrating an exemplary method 500 forallocating data blocks required for a single command as a singleInput/Output (I/O) for write and read commands. The method 500 begins(step 502). The method 500 determines if the command is a write command(step 504). If no, the method 500 will determine if the command is aread command (step 512). If yes, the method 500 may sequentiallyallocate the data blocks (step 506). The data blocks are independentlycompressed (step 508). A single I/O for the write command is issued withcontents of the data blocks (step 510). If the command is determined tobe a read command (step 512), the method 500 may, upon receipt of a readcommand (e.g., large read commands are used by the user), retrievingeach of the data blocks required for a single command to include as thesingle I/O (step 514). The data blocks that correspond to each other arefetched as a single read request (step 516). The method 500 ends (step518).

FIG. 6 is a flowchart illustrating an exemplary method 600 fororganizing and using lists that indicate the available space of datablocks. The method 600 begins (step 602) with organizing lists thatindicate available space (e.g., free space) for data blocks in advanceaccording to space size (step 604). The method 600 may determine if agroup of data block allocation is requested (step 606). If no, themethod 600 ends. If yes, the method 600 may determine if all the groupsof requested data blocks are found in a corresponding list (step 608).If yes, the method 600 may allocate the required number of sequentialdata blocks from the corresponding lists (step 610). If no, the method600 may allocate a larger group of data blocks from the next list(s)(step 612). Upon the release of one of the data blocks, the lists areupdated (step 614). The method 600 ends (step 616).

As will be appreciated by one skilled in the art, aspects of the presentinvention may be embodied as a system, method or computer programproduct. Accordingly, aspects of the present invention may take the formof an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present invention may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that may contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wired, optical fiber cable, RF, etc., or any suitable combination of theforegoing. Computer program code for carrying out operations for aspectsof the present invention may be written in any combination of one ormore programming languages, including an object oriented programminglanguage such as Java, Smalltalk, C++ or the like and conventionalprocedural programming languages, such as the “C” programming languageor similar programming languages. The program code may execute entirelyon the user's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present invention are described above with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, may be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that may direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks. The computer program instructions may also beloaded onto a computer, other programmable data processing apparatus, orother devices to cause a series of operational steps to be performed onthe computer, other programmable apparatus or other devices to produce acomputer implemented process such that the instructions which execute onthe computer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

The flowchart and block diagram in the above figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock might occur out of the order noted in the figures. For example,two blocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, may be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

While one or more embodiments of the present invention have beenillustrated in detail, one of ordinary skill in the art will appreciatethat modifications and adaptations to those embodiments may be madewithout departing from the scope of the present invention as set forthin the following claims.

What is claimed is:
 1. A method for compression blocks input/output(I/O) reduction by a processor device in a computing storageenvironment, the method comprising: arranging a plurality of availabledata blocks into a plurality of groups to provide a single I/O, whereina plurality of lists indicating the available block space for those ofthe plurality of available data blocks are organized in advanceaccording to space size; and allocating the plurality of available datablocks required for a single command as the single I/O, wherein theplurality of data blocks are sequentially ordered.
 2. The method ofclaim 1, wherein the plurality of available data blocks areindependently compressed.
 3. The method of claim 1, further including,in conjunction with the allocating, sequentially allocating theplurality of available data blocks for a write command, wherein thesingle I/O for the write command is issued to a storage device with thecontents of the plurality of available data blocks.
 4. The method ofclaim 1, further including, upon receipt of a read command, retrievingeach of the plurality of available data blocks required for the singlecommand to include as the single I/O.
 5. The method of claim 1, furtherincluding, upon a request for the allocating, allocating a requirednumber of the plurality of sequentially ordered available data blocksthat are sequential from a corresponding one of the plurality of lists.6. The method of claim 4, further including, if at least one of theplurality of groups is not found in a corresponding one of the pluralityof lists, allocating a larger group from the plurality of groups in asubsequent one of the plurality of lists.
 7. The method of claim 1,further including, updating the plurality of lists upon release of atleast one of the plurality of available data blocks.
 8. The method ofclaim 1, further including, reusing the plurality of available datablocks to enable the plurality of data blocks to be stored on aplurality of locations on a logical unit.